4-restricted Edge Cuts of Graphs
نویسنده
چکیده
A 4-restricted edge cut is an edge cut of a connected graph which disconnects the graph, where each component has order at least 4. Graphs that contain 4-restricted edge cuts are characterized in this paper. As a result, it is proved that a connected graph G of order at least 10 contains 4-restricted edge cuts if and only if it contains no cut-vertex u where every component of G \ u has order at most 3.
منابع مشابه
A bound on 4-restricted edge connectivity of graphs
An edge cut of a connected graph is 4-restricted if it disconnects this graph with each component having order at least four. The size of minimum 4-restricted edge cuts of graph G is called its 4-restricted edge connectivity and is denoted by 4(G). Let 4(G)=min{ (F ) : F is a connected vertex-induced subgraph of order four of graph G}, where (F ) denotes the number of edges of graph G with exac...
متن کاملOn Edge Cut of Graphs Leaving Components of Order at Least Five
An edge cut of a connected graph is 5-restricted if its removal leaves every component having order at least five. Graphs that contain 5-restricted edge cuts are characterized in this paper. As a result, it is shown that a connected graph G of order at least 13 contains 5-restricted edge cuts if and only if G \ v contains a component of order at least five for every vertex v of graph G.
متن کاملIncidence cuts and connectivity in fuzzy incidence graphs
Fuzzy incidence graphs can be used as models for nondeterministic interconnection networks having extra node-edgerelationships. For example, ramps in a highway system may be modeled as a fuzzy incidence graph so that unexpectedflow between cities and highways can be effectively studied and controlled. Like node and edge connectivity in graphs,node connectivity and arc connectivity in fuzzy inci...
متن کاملOn the 3-restricted edge connectivity of permutation graphs
An edge cut W of a connected graph G is a k-restricted edge cut if G−W is disconnected, and every component of G −W has at least k vertices. The k-restricted edge connectivity is defined as the minimum cardinality over all k-restricted edge cuts. A permutation graph is obtained by taking two disjoint copies of a graph and adding a perfect matching between the two copies. The k-restricted edge c...
متن کاملRIMS - 1731 Covering Cuts in Bridgeless Cubic Graphs
In this paper we are interested in algorithms for finding 2-factors that cover certain prescribed edge-cuts in bridgeless cubic graphs. We present an algorithm for finding a minimum-weight 2-factor covering all the 3-edge cuts in weighted bridgeless cubic graphs, together with a polyhedral description of such 2-factors and that of perfect matchings intersecting all the 3-edge cuts in exactly on...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Australasian J. Combinatorics
دوره 30 شماره
صفحات -
تاریخ انتشار 2004